Reversal Distance without Hurdles and Fortresses
نویسندگان
چکیده
This paper presents an elementary proof of the HannenhalliPevzner theorem on the reversal distance of two signed permutations. It uses a single PQ-tree to encode the various features of a permutation. The parameters called hurdles and fortress are replaced by a single one, whose value is computed by a simple and efficient algorithm.
منابع مشابه
Hurdles and Sorting by Inversions: Combinatorial, Statistical, and Experimental Results
As data about genomic architecture accumulates, genomic rearrangements have attracted increasing attention. One of the main rearrangement mechanisms, inversions (also called reversals), was characterized by Hannenhalli and Pevzner and this characterization in turn extended by various authors. The characterization relies on the concepts of breakpoints, cycles, and obstructions colorfully named h...
متن کاملA Qualitative Study of the Academic Hurdles Faced by Girls in Rurals Regions
A Qualitative Study of the Academic Hurdles Faced by Girls in Rurals Regions Z. Farzizaadeh, Ph.D. M. Taaleb, Ph.D. M. Motavaseli, Ph.D. Education as an important step in the process of empowerment, is considered as a natural human right and as such plays an important role in human development. One of the obvious problems in the countryside is the girls either do not attend scho...
متن کاملAn Improved Time-Reversal-Based Target Localization for Through-Wall Microwave Imaging
Recently, time reversal (TR) method, due to its high functionality in heterogeneous media has been widely employed in microwave imaging (MI) applications. One of the applications turning into a great interest is through-wall microwave imaging (TWMI). In this paper, TR method is applied to detect and localize a target obscured by a brick wall using a numerically generated data. Regarding this, i...
متن کاملHurdles Hardly Have to Be Heeded
As data about genomic architecture accumulates, genomic rearrangements have attracted increasing attention. One of the main rearrangement mechanisms, inversions (also called reversals), was characterized by Hannenhalli and Pevzner and this characterization in turn extended by various authors. The characterization relies on the concepts of breakpoints, cycles, and obstructions colorfully named h...
متن کاملDetecting Fortresses in Chess
We introduce a computational method for semi-automatical detecting fortresses in the game of chess. It is based on computer heuristic search and can be easily used with any state-of-the-art chess program. We also demonstrate a method for avoiding fortresses and show how to find a break-through plan when one exists. Although the paper is not concerned with the question whether it is practical or...
متن کامل